On g-functions for subshifts
نویسنده
چکیده
A necessary and sufficient condition is given for a subshift presentation to have a continuous g-function. An invariant necessary and sufficient condition is formulated for a subshift to posses a presentation that has a continuous g-function.
منابع مشابه
ON A CERTAIN CLASS OF g-FUNCTIONS FOR SUBSHIFTS
A property (D) of subshifts was defined in: Wolfgang Krieger, On gfunctions for subshifts, IMS Lecture NotesMonograph Series, Vol. 48, Dynamics & Stochastics (2006) 306 316, arXiv:math.DS/0608259. With a view towards a theory of g-fnctions beyond the case of finte type subshifts partially defined continuous gfunctions of property (D) subshifts are studied.
متن کاملDuality and Its Consequences for Ordered Cohomology of Finite Type Subshifts*
We construct a fundamental group for subshifts of nite type and prove that its abelianization gives a homology dual to ordered cohomology. We characterize cohomology classes representable as characteristic functions of clopen sets and give examples to illustrate what can happen for inclusions among clopen sets. We show that existence of unital ordered cohomology equivalence arising from isomorp...
متن کاملOn winning shifts of marked uniform substitutions
The second author introduced with I. Törmä a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131–152]. The game has a predetermined (possibly finite) choice sequence α1, α2, . . . of integers such that on round n the player A chooses a subset Sn of size αn of some fixed finite alphabet and the player B picks a letter from the set Sn. The outcome is determined by...
متن کاملRelative Entropy Functions for Factor Maps between Subshifts
Let (X,S) and (Y, T ) be topological dynamical systems and π : X → Y a factor map. A function F ∈ C(X) is a compensation function for π if P (F + φ ◦ π) = P (φ) for all φ ∈ C(Y ). For a factor code between subshifts of finite type, we analyze the associated relative entropy function and give a necessary condition for the existence of saturated compensation functions. Necessary and sufficient co...
متن کاملOn the Density of Periodic Configurations in Strongly Irreducible Subshifts
Let G be a residually finite group and let A be a finite set. We prove that if X ⊂ A is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in X. The density of periodic configurations implies in particular that every injective endomorphism of X is surjective and that the group of automorphisms of X is residually finite. We a...
متن کامل